package Week5.J0513;

import java.util.Scanner;

public class 笨小猴 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] hash = new int[26];
        char[] str = scanner.next().toCharArray();
        int maxn = 0;
        int minn = Integer.MAX_VALUE;

        for (char c : str) {
            hash[c - 'a']++;
            maxn = Math.max(maxn, hash[c - 'a']);
        }

        for (char c : str) {
            minn = Math.min(minn, hash[c - 'a']);
        }

        int ret = maxn - minn;

        if (isPrime(ret)) {
            System.out.println("Lucky Word");
            System.out.println(ret);
        }else {
            System.out.println("No Answer");
            System.out.println(0);
        }
    }

    private static boolean isPrime(int ret) {
        if (ret == 0 || ret == 1) return false;
        for (int i = 2; i < Math.sqrt(ret); i++) {
            if (ret % i == 0) return false;
        }
        return true;
    }
}
